Text Compression using Abstract Numeration System on a Regular Language
نویسنده
چکیده
An abstract numeration system (ANS) is a numeration system that provides a one-to-one correspondence between the natural numbers and a regular language. In this paper, we define an ANS-based compression as an extension of this correspondence. In addition, we show the following results: 1) an average compression ratio is computable from a language, 2) an ANS-based compression runs in sublinear time with respect to the length of the input string, and 3) an ANS-based compression can be extended to block-based compression using a factorial language.
منابع مشابه
Representing Real Numbers in a Generalized Numeration Systems
We show how to represent an interval of real numbers in an abstract numeration system built on a language that is not necessarily regular. As an application, we consider representations of real numbers using the Dyck language. We also show that our framework can be applied to the rational base numeration systems.
متن کاملMulti-dimensional sets recognizable in all abstract numeration systems
numeration systems An abstract numeration system is a triple S = (L,Σ, <) where L is an infinite regular language over the totally ordered alphabet (Σ, <) By enumerating words of L in the radix order (induced by <), we define a one-to-one correspondence between N and L repS : N → L : n 7→ (n + 1)th word of L valS = rep −1 S : L → N Abstract numeration systems Example S = (a∗b∗, {a, b}, a < b) L...
متن کاملCombinatorics, Automata and Number Theory
numeration systems The motivation for the introduction of abstract numeration systems stemsfrom the celebrated theorem of Cobham dating back to 1969 about the so-called recognisable sets of integers in any integer base numeration system.An abstract numeration system is simply an infinite genealogically ordered(regular) language. In particular, this notion extends the usual integ...
متن کاملA Decision Problem for Ultimately Periodic Sets in Non-standard Numeration Systems
Consider a non-standard numeration system like the one built over the Fibonacci sequence where nonnegative integers are represented by words over {0, 1} without two consecutive 1. Given a set X of integers such that the language of their greedy representations in this system is accepted by a finite automaton, we consider the problem of deciding whether or not X is a finite union of arithmetic p...
متن کاملAbstract Numeration Systems and Tilings
numeration systems and tilings Valérie Berthé and Michel Rigo 1 LIRMM, CNRS-UMR 5506, Univ. Montpellier II, 161 rue Ada, 34392 Montpellier Cedex 5, France, [email protected] 2 Université de Liège, Institut de Mathématiques, Grande Traverse 12 (B 37), B-4000 Liège, Belgium, [email protected] Abstract. An abstract numeration system is a triple S = (L,Σ,<) where (Σ,<) is a totally ordered alphabet an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1308.0267 شماره
صفحات -
تاریخ انتشار 2013